A decomposition algorithm applied to planning the interdiction of stochastic networks

We describe the application of a decomposition based solution method to a class of network interdiction problems. The problem of maximizing the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain is shown to be solved effectively by applying a scenario decomposition method developed by Riis and Schultz [Comput Optim Appl 24 (2003), 267–287]. Computational results demonstrate the effectiveness of the algorithm and design decisions that result in speed improvements. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Quantifying optimal mesh and ring design costs

During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于概率推断网的水雷战专家系统

针对反水雷作战决策的需要,运用贝叶斯推理、模糊逻辑以及可信度不确定推理方法,设计了一个基于概率推断网的水雷战专家系统.利用该系统可得出两种结论:一是利用计算概率的方法得出的结论,二是利用计算可信因子方法得出的结论,两种结论呈现定量和定性的互补关系.可较好地为反水雷作战指挥员提供辅助决策,以减少舰船遭毁伤的概率.     

灭雷具图像声呐探测过程仿真模型

根据灭雷具上高分辨率图像声呐的工作原理和探测过程,从为部队官兵提供模拟训练平台的角度出发,利用计算机的图形、图像处理和虚拟现实技术,提出一种数学模型和物理模型相结合的图像声呐可视化建模思路。通过仿真,证明此种方法既便于计算机实现,又符合灭雷具图像声呐的真实探测和显示过程。同时,为了整个仿真系统的需要,简单地给出了系统中三维海底地形和水雷目标的数据模型和构造方法。     

低空复杂场景红外弱小目标快速精准检测

针对低空复杂场景下红外弱小动目标检测难度大、虚警率高等问题,面向探测系统中高帧频图像实时处理应用需求,提出基于全卷积网络的弱小目标精准检测方法和基于现场可编程逻辑门阵列(field programmable gate array, FPGA)的低时延并行处理方法。采用轻量化全卷积网络对红外图像中弱小目标进行空域检测,对相邻图像帧疑似目标进行时域轨迹关联以进一步降低虚警率。实验结果表明:上述方法相比于五种传统方法在检测率和虚警率性能方面均有显著提升,并在单片FPGA上完成100 Hz图像实时处理,处理时延低于1.8 ms,实现低空复杂场景弱小目标高精度高鲁棒快速实时检测。     

Wasserstein距离在液体火箭发动机故障检测中的应用

健康监控技术能够切实提高液体火箭发动机的可靠性,针对液体火箭发动机健康监控中的故障检测问题,提出基于Wasserstein距离的方法,利用液氢液氧火箭发动机地面热试车数据进行验证。该方法的核心思想是利用Wasserstein生成对抗网络模拟正常数据的样本分布,利用其判别器计算测试样本与模拟分布间的Wasserstein距离,进而实现故障检测。结果表明:该方法能够克服故障数据不足的困难,有效检测稳态过程中的故障,没有发生误报警,且对早期异常有较高敏感性;在训练样本较少的情况下,当Wasserstein距离阈值为3σ时对启动过程的早期异常有较高敏感性,取5σ时仍可有效检测启动过程中的故障,误报警率为12.5%。     

网络舆情中一种基于OLDA的在线话题演化方法

研究网络舆情分析中话题演化方法.首先分析网络舆情信息的特点;在此基础上,建立网络舆情信息模型,基于话题模型抽象描述文本内容的隐含语义,进而建立文本流在时间序列上的关联模型;进一步,提出基于OLDA的话题演化方法,针对舆情信息的特点,建立不同时间片话题间的关联.实验结果表明,该方法能够有效检测话题演化,为网络舆情分析提供了有效途径.     

具有优先级消息的AFDX建模与性能分析

以Petri网为工具,建立了基于具有优先级消息传输的AFDX(航空电子全双工以太网)网络模型,通过仿真,求解出消息发送时的平均等待时间,得到的指标结果验证了高优先级数据消息帧发送等待延时明显小于低优先级数据消息帧的发送等待延时,充分说明了优先级对紧急数据传输的重要性。模型有助于进一步理解航电系统不同优先级消息在AFDX网络中的传输机制,为以AFDX为总线的综合航电系统的设计和完善提供重要的理论依据。     

编队对地攻击联合火力分配问题的Swt-opt算法

根据未来战争中编队对地攻击的特点,运用一致算法(consensus algorithm)的思想对Swt-opt算法进行改进,解决关于传感器-武器-目标的联合火力分配问题。改进算法继承了Swt-opt算法解决资源分配问题在通信、计算以及对战场态势的容错能力方面的优势,克服了Swt-opt算法受限于网络拓扑结构的缺点。最后,证明了改进算法的可行性,并运用Matlab对改进算法进行了仿真实现。     

一种面向节点定位的移动信标动态路径规划方法

针对基于移动信标的传感器节点定位问题,提出一种基于在线决策的移动信标动态路径规划方法.针对以往算法大都只适用于节点均匀分布的局限,该方法用移动信标不断获取两跳范围内的未定位节点数目,并向最大覆盖未定位节点方向移动,不需要网络先验信息,即可实现路径的优化.仿真结果表明:与传统方法相比,该方法无需网络的先验信息,在移动路径长度上具有明显优越性,减少了信标的能量消耗,更适用于户外部署的大规模传感器网络.